au.\*:("JINGSEN CHEN")
Results 1 to 6 of 6
Selection :
Ranking k maximum sumsBENGTSSON, Fredrik; JINGSEN CHEN.Theoretical computer science. 2007, Vol 377, Num 1-3, pp 229-237, issn 0304-3975, 9 p.Article
On partitions and presortedness of sequencesCARLSSON, S; JINGSEN CHEN.Acta informatica. 1992, Vol 29, Num 3, pp 267-280, issn 0001-5903Article
Efficient algorithms for k maximum sumsBENGTSSON, Fredrik; JINGSEN CHEN.Lecture notes in computer science. 2004, pp 137-148, issn 0302-9743, isbn 3-540-24131-0, 12 p.Conference Paper
Efficient algorithms for k maximum sumsBENGTSSON, Fredrik; JINGSEN CHEN.Algorithmica. 2006, Vol 46, Num 1, pp 27-41, issn 0178-4617, 15 p.Conference Paper
A note on the construction of the data structure «deap»CARLSSON, S; JINGSEN CHEN; STROTHOTTE, T et al.Information processing letters. 1989, Vol 31, Num 6, pp 315-317, issn 0020-0190Article
Computing Maximum-Scoring Segments in Almost Linear TimeBENGTSSON, Fredrik; JINGSEN CHEN.Lecture notes in computer science. 2006, pp 255-264, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper